A ð1:5þ Þ-Approximation Algorithm for Unsigned Translocation Distance
نویسندگان
چکیده
Genome rearrangement is an important area in computational biology and bioinformatics. The translocation operation is one of the popular operations for genome rearrangement. It was proved that computing the unsigned translocation distance is NP-hard. In this paper, we present a ð1:5þ Þ-approximation algorithm for computing the unsigned translocation distance that improves upon the best known 1.75-ratio. The runtime of our algorithm is Oðn þ ð Þ 1:5 ffiffiffiffiffiffiffiffiffiffiffiffi logð Þ q 2 4 Þ, where n is the total number of genes in the genome.
منابع مشابه
A 1.75-Approximation Algorithm for Unsigned Translocation Distance
The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [J. Kececioglu, R. Ravi, Of mice and men: Algorithms for evolutionary distances between genomes with translocation, in: 6th ACM–SIAM Symposium on D...
متن کاملOn the complexity of unsigned translocation distance
Translocation is one of the basic operations for genome rearrangement. Translocation distance is the minimum number of translocations required to transform one genome into the other. In this paper, we show that computing the translocation distance for unsigned genomes is NP-hard. Moreover, we show that approximating the translocation distance for unsigned genomes within ratio 1.00017 is NP-hard...
متن کاملTime discretized operators. Part 2: towards the theoretical design of a new generation of a generalized family of unconditionally stable implicit and explicit representations of arbitrary order for computational dynamics
The new generation of a generalized family of time discretized operators encompassing implicit and explicit representations that are unconditionally stable and which theoretically inherit Nth-order time accurate features developed in Part 1 are restricted here in Part 2 of the exposition to second-order time accurate operators. As such, unconditionally stable implicit representations are first ...
متن کاملOn two Turán Numbers
Let Hð3;1Þ denote the complete bipartite graph K3;3 with an edge deleted. For given graphs G and F , the Turán numbers exðG; FÞ denote the maximum number of edges in a subgraph of G containing no copy of F . We prove that exðKn;n;Hð3; 1ÞÞ ð4= ffiffiffi 7 p n þOðnÞ 1:5119n þOðnÞ and that exðKn;Hð3; 1ÞÞ ð1=5Þ ffiffiffiffiffi 15 p n þOðnÞ 0:7746n þ OðnÞ, which improve earlier results of Mubayi-Wes...
متن کاملSimpler is also better in approximating fixed points
In this paper we demonstrate that a number of fixed point iteration problems can be solved using a modified Krasnoselskij iteration process, which is much simpler to use than the other iteration schemes that have been defined. 2008 Elsevier Inc. All rights reserved. For maps with a slow enough growth rate, the Banach contraction principle provides the existence and uniqueness of the fixed point...
متن کامل